Refactor Heap Sorts to use Writes instead of Swaps #69
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
MusicTheorist
added
enhancement
|
this looks good to me, and i think something similar could be applied to other selection sorts as well. |
Owner
|
I would prefer a separate "optimized" version, yeah! Remember that we're going to better organize the sort/shuffle/distribution lists later on to cut down on the clutter! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Similar case that separates Optimized Gnome from Insertion.
The total amount of writes can be halved by inserting the item down the heap instead of swapping.
Changed:
Max Heap
Min Heap
Flipped Min Heap
Ternary Heap
Unchanged:
Weak Heap - makes the implementation a lot less intuitive
Poplar Heap - doesn't directly improve the sort